The existence of resolvable Steiner quadruple systems
نویسنده
چکیده
A Steiner quadruple system of order v is a set X of cardinality v, and a set Q, of 4-subsets of X, called blocks, with the property that every 3-subset of X is contained in a unique block. A Steiner quadruple system is resolvable if Q can be partitioned into parallel classes (partitions of X). A necessary condition for the existence of a resolvable Steiner quadruple system is that v = 4 or 8 (mod 12). In this paper we show that this condition is also suflicient for all values of V, with 24 possible exceptions.
منابع مشابه
The last twenty orders of (1, 2)-resolvable Steiner quadruple systems
A Steiner quadruple system (X, B) is said to be (1, 2)-resolvable if its blocks can be partitioned into r parts such that each point of X occurs in exactly two blocks in each part. The necessary condition for the existence of (1, 2)-resolvable Steiner quadruple systems RSQS(1, 2, v)s is v ≡ 2 or 10 (mod 12). Hartman and Phelps in [A. Hartman, K.T. Phelps, Steiner quadruple systems, in: J.H. Din...
متن کاملOn 2-ranks of Steiner triple systems
Our main result is an existence and uniqueness theorem for Steiner triple systems which associates to every such system a binary code | called the \carrier" | which depends only on the order of the system and its 2-rank. When the Steiner triple system is of 2-rank less than the number of points of the system, the carrier organizes all the information necessary to construct directly all systems ...
متن کاملOn the Preparata-like codes
A class of Preparata-like group codes is considered. It was suggested by Baker, van Lint and Wilson and re-stated in a different form by Ericson. We show that all such codes are inside the Hamming code providing its partition into the cosets of the Preparata-like codes. This partition induces 2-resolvable Steiner quadruple systems.
متن کاملSmall Group Divisible Steiner Quadruple Systems
Melissa Keranen∗, Donald Kreher, Artem Zhuravlev, Michigan Technological University A group divisible Steiner quadruple system, is a triple (X,H,B) where X is a v-element set of points, H = {H1, H2, . . . , Hr} is a partition of X into holes and B is a collection of 4-element subsets of X called blocks such that every 3-element subset is either in a block or a hole but not both. We investigate ...
متن کاملNonagon quadruple systems: existence, balance, embeddings
A cycle of length 9 of vertices (x1, x2, . . . , x9), in the cyclical order, with the three edges {x1, x4}, {x4, x7}, {x1, x7} is called an NQ-graph or also a nonagon quadruple graph. A nonagon quadruple system, briefly NQS, of order v and index λ is an NQ-decomposition of the complete multigraph λKv. An NQS is said to be perfect if the inside K3, generated by the vertices x1, x4, x7, forms a S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 44 شماره
صفحات -
تاریخ انتشار 1987